Quantum games via search algorithms
نویسندگان
چکیده
منابع مشابه
Quantum games via search algorithms
We build new quantum games, similar to the spin flip game, where as a novelty the players perform measurements on a quantum system associated to a continuous time search algorithm. The measurements collapse the wave function into one of the two possible states. These games are characterized by a continuous space of strategies and the selection of a particular strategy is determined by the momen...
متن کاملQuantum Games and Quantum Algorithms
A quantum algorithm for an oracle problem can be understood as a quantum strategy for a player in a two-player zero-sum game in which the other player is constrained to play classically. I formalize this correspondence and give examples of games (and hence oracle problems) for which the quantum player can do better than would be possible classically. The most remarkable example is the Bernstein...
متن کاملQuantum algorithms for the ordered search problem via semidefinite programming
Andrew M. Childs,* Andrew J. Landahl, and Pablo A. Parrilo Institute for Quantum Information, California Institute of Technology, Pasadena, California 91125, USA Center for Advanced Studies, Department of Physics and Astronomy, University of New Mexico, Albuquerque, New Mexico 87131, USA Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, Massachus...
متن کاملParrondo Games and Quantum Algorithms
We pursue the possible connections between classical games and quantum computation. The Parrondo game is one in which a random combination of two losing games produces a winning game. We introduce novel realizations of this Parrondo effect in which the player can ‘win’ via random reflections and rotations of the state-vector, and connect these to known quantum algorithms. [email protected]...
متن کاملNonadiabatic quantum search algorithms
We present two continuous-time quantum search algorithms similar to the adiabatic search algorithm, but now without the requirement of adiabatic evolution. Both algorithms can find the marked state in a time proportional to N. The behavior of the first algorithm is, essentially, similar to Grover’s algorithm, but the second model possesses the important property that one does not need to single...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2007
ISSN: 0378-4371
DOI: 10.1016/j.physa.2007.02.029